The implementation of cubic public keys based on a new family of algebraic graphs

Families of edge transitive algebraic graphs defined over finite commutative rings were used for the development of stream ciphers, public key cryptosystems and key exchange protocols. We present the results of the first implementation of a public key algorithm based on the family of algebraic graphs, which are not edge transitive. The absence of an edge transitive group of symmetries means that the algorithm can not be described in group theoretical terms. We hope that it licates cryptanalysis of the algorithm. We discuss the connections between the security of algorithms and the discrete logarithm problem. The plainspace of the algorithm is K, where K is the chosen commutative ring. The graph theoretical encryption corresponds to walk on the bipartite graph with the partition sets which are isomorphic to K. We conjugate the chosen graph based encryption map, which is a composition of several elementary cubical polynomial automorphisms of a free module K with special invertible affine transformation of K. Finally we compute symbolically the ∗E-mail address: [email protected] †E-mail address: urszula [email protected] ‡E-mail address: [email protected] Pobrane z czasopisma Annales AIInformatica http://ai.annales.umcs.pl Data: 08/02/2018 06:04:05